package demo7;

/**
 * Created with IntelliJ IDEA.
 * Description:二叉树遍历
 * User: liangyuanzhang
 * Date: 2025-4-23
 * Time: 1:06
 */
class TreeNode{
    public char val;
    public TreeNode left;
    public TreeNode right;

    public TreeNode(char val){
        this.val = val;
    }
}

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextLine()) { // 注意 while 处理多个 case
            String str = in.nextLine();
            TreeNode root = craeteTree(str);
            inorderTree(root);
        }
    }

    public static int i = 0;
    public static TreeNode craeteTree(String str) {
        TreeNode root = null;
        if(str.charAt(i) != '#'){
            root = new TreeNode(str.charAt(i));
            i++;
            root.left = craeteTree(str);
            root.right = craeteTree(str);
        }else{
            i++;
        }
        return root;
    }

    public static void inorderTree(TreeNode root) {//中序遍历
        if(root == null) return;
        inorderTree(root.left);
        //打印
        System.out.print(root.val + " ");
        inorderTree(root.right);
    }
}
